package leetcode.top100;

import leetcode.剑指offer.pojo.ListNode;
import org.junit.Test;

/**
 * @author ：zsy
 * @date ：Created 2022/10/23 9:56 PM
 * @description：
 */
public class _019_删除链表的倒数第N个结点 {
    @Test
    public void test() {

    }

    /**
     * Definition for singly-linked list.
     * public class ListNode {
     *     int val;
     *     ListNode next;
     *     ListNode() {}
     *     ListNode(int val) { this.val = val; }
     *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
     * }
     */
    class Solution {
        public ListNode removeNthFromEnd(ListNode head, int n) {
            ListNode tmpA = head;
            return null;
        }
    }
}
